An Algebraic Theory for Primal and Dual Substructuring Methods by Constraints
نویسندگان
چکیده
FETI and BDD are two widely used substructuring methods for the solution of large sparse systems of linear algebraic equations arizing from discretization of elliptic boundary value problems. The two most advanced variants of these methods are the FETI-DP and the BDDC methods, whose formulation does not require any information beyond the algebraic system of equations in a substructure form. We formulate the FETI-DP and the BDDC methods in common framework as methods based on general constraints between the substructures, and provide a simplified algebraic convergence theory. The basic implementation blocks including transfer operators are common to both methods. It is shown that commonly used properties of the transfer operators in fact determine the operators uniquely. Identical algebraic condition number bounds for both methods are given in terms of a single inequality, and, under natural additional assumptions, it is proved that the eigenvalues of the preconditioned problems are the same. The algebraic bounds imply the usual polylogarithmic bounds for finite elements, independent of coefficient jumps between substructures. Computational experiments confirm the theory.
منابع مشابه
Selecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions
Iterative substructuring methods with Lagrange multipliers for the elliptic system of linear elasticity are considered. The algorithms belong to the family of dual-primal FETI methods which was introduced for linear elasticity problems in the plane by Farhat et al. [2001] and then extended to three dimensional elasticity problems by Farhat et al. [2000]. In dual-primal FETI methods, some contin...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملDual-Primal FETI Methods for Three-Dimensional Elliptic Problems with Heterogeneous Coefficients
In this paper, certain iterative substructuring methods with Lagrange multipliers are considered for elliptic problems in three dimensions. The algorithms belong to the family of dual{ primal FETI methods which have recently been introduced and analyzed successfully for elliptic problems in the plane. The family of algorithms for three dimensions is extended and a full analysis is provided for ...
متن کاملDual-primal Feti Methods for Linear Elasticity
Dual-Primal FETI methods are nonoverlapping domain decomposition methods where some of the continuity constraints across subdomain boundaries are required to hold throughout the iterations, as in primal iterative substructuring methods, while most of the constraints are enforced by Lagrange multipliers, as in one-level FETI methods. The purpose of this article is to develop strategies for selec...
متن کامل